package 所有的题类.ZF.分治算法;

import com.kiwi.nixu.common.LNode;

public class 合并K个升序链表 {

    public static LNode mergeKLists(LNode[] lists) {

        return null;
    }

    public static LNode divideAndMerger(LNode [] lNodes,int start,int end){
        if(start==end){
            return lNodes[start];
        }
        int mid=(start+end)/2;
        LNode left = divideAndMerger(lNodes, start, mid);
        LNode right = divideAndMerger(lNodes, mid+1, end);

        return merger(left,right);
    }

    public static LNode merger(LNode left,LNode right){

        return null;
    }


}
